Fast planning through planning graph analysis
نویسندگان
چکیده
منابع مشابه
Fast Planning Through Planning Graph Analysis
We introduce a new approach to planning in STRIPS-like domains based on constructing and analysing a compact structure we call a Planning Graph We describe a new planner, Graphplan, that uses this paradigm Graphplan always returns a shortest-possible partial-order plan, or states that no valid plan exists We provide empirical evidence in favor of this approach, showing that Graphplan outperform...
متن کاملDistributed Planning through Graph Merging
In this paper, we introduce a generic and fresh model for distributed planning called “Distributed Planning Through Graph Merging” (DPGM). This model unifies the different steps of the distributed planning process into a single step. Our approach is based on a planning graph structure for the agent reasoning and a CSP mechanism for the individual plan extraction and the coordination. We assume ...
متن کاملSimplifying graph-based planning through abstraction
During the resolution of a planning problem the planner performs causal and resource reasoning. Causal reasoning refers to the generation of a sequence of actions (instantiated operators) which when executed in the initial state will result in the state of the world that contains the goals. Resource reasoning refers to the allocation of resources to the actions that form the plan in order to ob...
متن کاملFast Planning through Greedy Action Graphs
Domain-independent planning is a notoriously hard search problem. Several systematic search techniques have been proposed in the context of various formalisms. However, despite their theoretical completeness, in practice these algorithms are incomplete because for many problems the search space is too large to be (even partially) explored. In this paper we propose a new search method in the con...
متن کاملFast Probabilistic Planning through Weighted Model Counting
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-FF to problems with probabilistic uncertainty about both the initial state and action effects. Specifically, Probabilistic-FF combines Conformant-FF’s techniques with a powerful machinery for weighted model counting in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1997
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(96)00047-1